The computational complexity of graph contractions II: Two tough polynomially solvable cases
نویسندگان
چکیده
For a fixed pattern graph H , let H -CONTRACTIBILITY denote the problem of deciding whether a given input graph is contractible to H . This article is part II of our study on the computational complexity of the H -CONTRACTIBILITY problem. In the first article we pinpointed the complexity for all pattern graphswith five vertices except for two pattern graphs H . Here, we present polynomial time algorithms for these two remaining pattern graphs. Interestingly, in all connected cases that are known to be polynomially solvable, the pattern graph H has a dominating vertex, whereas in all cases that are known to be NP-complete, the pattern graph H does not have a dominating vertex. © 2008Wiley Periodicals, Inc. NETWORKS, Vol. 52(1), 32–56 2008
منابع مشابه
The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases
For a fixed pattern graph H , let H -Contractibility denote the problem of deciding whether a given input graph is contractible to H . This paper is part I of our study on the computational complexity of the H -Contractibility problem. We continue a line of research that was started in 1987 by Brouwer and Veldman, and we determine the computational complexity of the H -Contractibility problem f...
متن کاملThe Complexity of Graph Contractions
For a fixed pattern graph H, let H-CONTRACTIBILITY denote the problem of decidingwhether a given input graph is contractible to H. We continue a line of research that wasstarted in 1987 by Brouwer & Veldman, and we determine the computational complexity ofH-CONTRACTIBILITY for certain classes of pattern graphs. In particular, we pin-pointthe complexity for all graphs H with five...
متن کاملPlanar graph coloring avoiding monochromatic subgraphs: trees
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detailed study of the computational complexity of this problem. We present a complete picture for the case with a single forbidden connected (induced or noninduced) subgraph. The 2-coloring problem is NP-hard if the forbidde...
متن کاملDeposited in DRO : 02
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detailed study of the computational complexity of this problem. We present a complete picture for the case with a single forbidden connected (induced or non-induced) subgraph. The 2-coloring problem is NP-hard if the forbidd...
متن کاملComplexity and approximation for Traveling Salesman Problems with profits
In TSP with profits we have to find an optimal tour and a set of customers satisfying a specific constraint. In this paper we analyze three different variants of TSP with profits that are NP-hard in general. We study their computational complexity on special structures of the underlying graph, both in the case with and without service times to the customers. We present polynomial algorithms for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Networks
دوره 52 شماره
صفحات -
تاریخ انتشار 2008